A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
نویسندگان
چکیده
Given a bipartite graph G = (S, T, E), the k-clustering Minimum Biclique Completion Problem (k-MinBCP) consists of finding k bipartite subgraphs (clusters), such that each vertex i of S appears in exactly one subgraph, every vertex j in T appears in each cluster in which at least one of its neighbors appears, and the total number of edges that would complete each subgraph into a complete bipartite subgraph, i.e., a biclique, is minimized. This problem was introduced in [1], as an application of the problem of bundling channels in multicast transmissions. k-MinBCP is NP-Hard, and its approximability, to the best of our knowledge, remains unknown. In the literature, k-MinBCP is tackled with two approaches: in [1], it is solved with an Integer Programming approach, a Bilinear Programming formulation and its standard linearization; and in [2], it is solved with an hybrid Constraint Programming–Semidefinite programming approach.
منابع مشابه
Fuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem
This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...
متن کاملOn the maximum edge biclique packing problem: formulations and computational experiments
A biclique is a complete bipartite graph. Given a (L,R)-bipartite graph G = (V,E) and a positive integer k, the maximum edge biclique packing (mebp) problem consists in finding a set of at most k bicliques, subgraphs of G, such that the bicliques are vertex disjoint with respect to a subset S ⊆ V and the number of edges inside the bicliques is maximized. The maximum edge biclique (meb) problem ...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملA hybrid DEA-based K-means and invasive weed optimization for facility location problem
In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITOR
دوره 20 شماره
صفحات -
تاریخ انتشار 2010